The cutting plane method is polynomial for perfect matchings

The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several authors over past decades. Its convergence has been an open question. We develop a cutting plane algorithm that converges in polynomial-time using only Edmonds’ blossom inequalities, and which maintains half-integral intermediate LP solutions supported by a disjoint union of odd cycles and edges. Our main insight is a method to retain only a subset of the previously added cutting planes based on their dual values. This allows us to quickly find violated blossom inequalities and argue convergence by tracking the number of odd cycles in the support of intermediate solution

On the pentaquark candidates p+c (4380) and p+c (4450) within the soliton picture of baryons

Using the bound state version of the topological soliton model for the baryons we show that the existence of a bound (or quasi-bound) D-soliton state leads to the possibility of having hidden charm pentaquarks with quantum numbers and masses, which are compatible with those of the candidates recently reported by the LHCb experiment. The implications of heavy quark symmetry are elaborated.Fil: Scoccola, Norberto Nerio. Universidad Favaloro. Facultad de Ingeniería y Ciencias Exactas y Naturales; Argentina. Comisión Nacional de Energía Atómica. Gerencia del Área de Investigación y Aplicaciones no Nucleares. Gerencia Física (CAC). Grupo de Física Teórica; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Riska, D. O.. Finnish Society Of Science And Letters; FinlandiaFil: Rho, María Gabriela. Centre D'etudes de Saclay; Franci